ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS
نویسندگان
چکیده
منابع مشابه
On the Graph Edit Distance Cost: Properties and Applications
We model the edit distance as a function in a labelling space. A labelling space is an Euclidean space where coordinates are the edit costs. Through this model, we define a class of cost. A class of cost is a region in the labelling space that all the edit costs have the same optimal labelling. Moreover, we characterise the distance value through the labelling space. This new point of view of t...
متن کاملBayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate mat...
متن کاملThe maximum edit distance from hereditary graph properties
For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the largest possible edit distance of a graph on n vertices from P? Denote this distance by ed(n,P). A graph property is hereditary if it is closed under removal of vertic...
متن کاملAutomatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarity of attributed graphs in an error-tolerant way. The key idea is to model graph variations by structural distortion operations. As one of its main constraints, however, the edit distance requires the adequate definitio...
متن کاملMap Edit Distance vs. Graph Edit Distance for Matching Images
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2012
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s021800141260004x